On the similarity metric and the distance metric

نویسندگان

  • Shihyen Chen
  • Bin Ma
  • Kaizhong Zhang
چکیده

Similarity and dissimilarity measures are widely used in many research areas and applications. When a dissimilarity measure is used, it is normally required to be a distance metric. However, when a similarity measure is used, there is usually no formal requirement. In this talk, we will present the following results. We first present a formal definition of similarity metric. We then show the relationship between similarity metric and distance metric. Finally, we present general solutions to normalize a given similarity metric or distance metric. ! Dr. K. Zhang received the M.S. degree in mathematics from Peking University, Beijing, China, in 1981, and the M.S. and Ph.D. degrees in computer science from the Courant Institute of Mathematical Sciences, New York University, New York, USA, in 1986 and 1989, respectively. He is currently a professor in the Department of Computer Science, University of Western Ontario, London, Ontario, Canada. His research interests include Bioinformatics, Algorithms, image processing and databases. Western University, Middlesex College, Rm. 255, 1151 Richmond St. London, ON, Canada N6A 5B7 Tel: +1 519 661 3649, FAX: +1 519 661 3523. Home page: www.apmaths.uwo.ca.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Composite Kernel Optimization in Semi-Supervised Metric

Machine-learning solutions to classification, clustering and matching problems critically depend on the adopted metric, which in the past was selected heuristically. In the last decade, it has been demonstrated that an appropriate metric can be learnt from data, resulting in superior performance as compared with traditional metrics. This has recently stimulated a considerable interest in the to...

متن کامل

An Effective Approach for Robust Metric Learning in the Presence of Label Noise

Many algorithms in machine learning, pattern recognition, and data mining are based on a similarity/distance measure. For example, the kNN classifier and clustering algorithms such as k-means require a similarity/distance function. Also, in Content-Based Information Retrieval (CBIR) systems, we need to rank the retrieved objects based on the similarity to the query. As generic measures such as ...

متن کامل

یادگیری نیمه نظارتی کرنل مرکب با استفاده از تکنیک‌های یادگیری معیار فاصله

Distance metric has a key role in many machine learning and computer vision algorithms so that choosing an appropriate distance metric has a direct effect on the performance of such algorithms. Recently, distance metric learning using labeled data or other available supervisory information has become a very active research area in machine learning applications. Studies in this area have shown t...

متن کامل

ROBUSTNESS OF THE TRIPLE IMPLICATION INFERENCE METHOD BASED ON THE WEIGHTED LOGIC METRIC

This paper focuses on the robustness problem of full implication triple implication inference method for fuzzy reasoning. First of all, based on strong regular implication, the weighted logic metric for measuring distance between two fuzzy sets is proposed. Besides, under this metric, some robustness results of the triple implication method are obtained, which demonstrates that the triple impli...

متن کامل

The Existence Theorem for Contractive Mappings on $wt$-distance in $b$-metric Spaces Endowed with a Graph and its Application

In this paper, we study the existence and uniqueness of fixed points for mappings with respect to a $wt$-distance in $b$-metric spaces endowed with a graph. Our results are significant, since we replace the condition of continuity of mapping with the condition of orbitally $G$-continuity of mapping and we consider $b$-metric spaces with graph instead of $b$-metric spaces, under which can be gen...

متن کامل

Fixed point theorems under c-distance in ordered cone metric space

Recently, Cho et al. [Y. J. Cho, R. Saadati, S. H. Wang, Common xed point theorems on generalized distance in ordered cone metric spaces, Comput. Math. Appl. 61 (2011) 1254-1260] dened the concept of the c-distance in a cone metric space and proved some xed point theorems on c-distance. In this paper, we prove some new xed point and common xed point theorems by using the distance in ordered con...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 410  شماره 

صفحات  -

تاریخ انتشار 2009